翻訳と辞書 |
Cube-connected cycles : ウィキペディア英語版 | Cube-connected cycles
In graph theory, the cube-connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was introduced by for use as a network topology in parallel computing. == Definition == The cube-connected cycles of order ''n'' (denoted CCC''n'') can be defined as a graph formed from a set of ''n''2''n'' nodes, indexed by pairs of numbers (''x'', ''y'') where 0 ≤ ''x'' < 2''n'' and 0 ≤ ''y'' < ''n''. Each such node is connected to three neighbors: , , and , where "⊕" denotes the bitwise exclusive or operation on binary numbers.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cube-connected cycles」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|